Leakage-Resilient Lattice-Based Partially Blind Signatures

Blind signature schemes (BSS) play a pivotal role in privacy-oriented cryptography. However, with blind signature schemes, the signed message remains unintelligible to the signer, giving them no guarantee that the blinded message he signed actually contained valid information. Partially-blind signature schemes (PBSS) were introduced to address precisely this problem. In this paper we present the first leakage-resilient, lattice-based partially-blind signature scheme in the literature. Our construction is provably secure in the random oracle model (ROM) and offers quasilinear complexity w.r.t. key/signature sizes and signing speed. In addition, it offers statistical partial blindness and its unforgeability is based on the computational hardness of worst-case ideal lattice problems for approximation factors in $˜ O(n^4)$ in dimension $n$. Our scheme benefits from the subexponential hardness of ideal lattice problems and remains secure even if a (1-o(1)) fraction of the signer’s secret key leaks to an adversary via arbitrary side-channels. Several extensions of the security model, such as honest-user unforgeability and selective failure blindness, are also considered and concrete parameters for instantiation are proposed

Mitochondrial DNA Regionalism and Historical Demography in the Extant Populations of Chirocephalus kerkyrensis (Branchiopoda: Anostraca)

Background: Mediterranean temporary water bodies are important reservoirs of biodiversity and host a unique assemblage of diapausing aquatic invertebrates. These environments are currently vanishing because of increasing human pressure. Chirocephalus kerkyrensis is a fairy shrimp typical of temporary water bodies in Mediterranean plain forests and has undergone a substantial decline in number of populations in recent years due to habitat loss. We assessed patterns of genetic connectivity and phylogeographic history in the seven extant populations of the species from Albania, Corfu Is. (Greece), Southern and Central Italy. Methodology/Principal Findings: We analyzed sequence variation at two mitochondrial DNA genes (Cytochrome Oxidase I and 16s rRNA) in all the known populations of C. kerkyrensis. We used multiple phylogenetic, phylogeographic and coalescence-based approaches to assess connectivity and historical demography across the whole distribution range of the species. C. kerkyrensis is genetically subdivided into three main mitochondrial lineages; two of them are geographically localized (Corfu Is. and Central Italy) and one encompasses a wide geographic area (Albania and Southern Italy). Most of the detected genetic variation (<81%) is apportioned among the aforementioned lineages. Conclusions/Significance: Multiple analyses of mismatch distributions consistently supported both past demographic and spatial expansions with the former predating the latter; demographic expansions were consistently placed during interglacial warm phases of the Pleistocene while spatial expansions were restricted to cold periods. Coalescence methods revealed a scenario of past isolation with low levels of gene flow in line with what is already known for other co-distributed fairy shrimps and suggest drift as the prevailing force in promoting local divergence. We recommend that these evolutionary trajectories should be taken in proper consideration in any effort aimed at protecting Mediterranean temporary water bodies

Can genetic algorithms improve trading decisions in financial markets?

Over the last years, trading systems are widely used for market assessment however parameter optimization of these systems has adopted little concern. This paper, paper provides an answer to the question Can Genetic Algorithms Improve Trading Decisions in Financial Markets? Our proposed MATLAB based tool uses the power of genetic algorithms to generate fast and efficient solutions in real trading terms. By testing our trading system extensively on historical data of Emerging Stock markets we found that GATradeTool outperformed commonly used, non-adaptive, software tools with respect to the stability of return and time saving over the whole sample period

Energy issues in software design of embedded systems

Abstract:- The increasing use of programmable processor cores in embedded systems which are mainly used in portable devices, creates an intense need for low power operation. Although power has been primarily addressed at the circuit/technology level it has become obvious that power consumption is heavily dependent on the executing software. The goal of this paper is to illustrate the impact of several software decisions on the energy consumption of the underlying hardware and the need to consider power in software design

Energy Estimation with SystemC: A Programmer&apos;s Perspective

Abstract:- A modification to the SystemC library to enable power estimation of digital systems built upon a set of primitive logic gates is proposed. Acknowledging both the intense requirement for low power systems as well as the increasing use of SystemC as a modeling methodology, an approach for obtaining the dynamic power consumption of SystemC modules is presented. In order to correctly handle glitches during energy estimation, a simulation approach based on guarded evaluation is used. Emphasis is given to the fact that extensions to SystemC can be performed in a simple manner broadening the design and analysis possibilities of circuit designers. Even computer science students, with limited background on digital electronics, can easily grasp the concept of energy consumption and implement enhancements to SystemC, justifying its use as a common modeling platform between HW and SW designers. Key-Words:- SystemC, energy consumption, low power, simulation, C++, modeling, object-oriented languages 1

Simulation Software for a Network Modelling Lab

This paper introduces a software application that simulates the most common types of queues. It also compares the simulations results with the values that the mathematical model predicts for specific types of queues. Thus, the software we have developed has two academic aspects. The first one applies to its ability to simulate most of the queuing processes that take place in computer networks. Therefore someone who studies network modelling or computer performance analysis may use it to derive some practical results in a very convenient way. The second aspect of the software refers to the part of the application that simulates specific types of queue and it can be used as a guide for teaching network modelling. We believe that it is very easy for someone to understan